Compositional Reasoning for Processes and Data
نویسندگان
چکیده
The specification language CSP-CASL allows the modelling of processes and data within a single framework. CSPCASL allows one to use the specification structuring operators, such as parametrization and union, to create structured specifications. Here we outline proof calculi that exploit specification structure, allowing for refinement and deadlock analysis.
منابع مشابه
Synthesizing di erent development paradigms : Combining top - down with bottom - up reasoning about distributedsystems 1
Our goal is the presentation of a uniform framework for compositional reasoning about the development of distributed processes and data structures.This framework should be a synthesis because, depending on the structure of the processes involved and the veriication steps required, diierent formalisms are most suitable for carrying out one's reasoning. We illustrate this uniform framework by pre...
متن کاملA Compositional Proof System for theModal
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal-calculus and combines it with techniques from work on local model checking. The proof system is sound for all process...
متن کاملA Compositional Proof System for the Modal -Calculus
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal -calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal -calculus and combines it with techniques from work on local model checking. The proof system is sound for all proce...
متن کاملCompositional Metric Reasoning with Probabilistic Process Calculi
We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the ...
متن کاملCompositional bisimulation metric reasoning with Probabilistic Process Calculi
We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the ...
متن کامل